A direct proof of Porcelli’s condition for weak convergence
نویسندگان
چکیده
منابع مشابه
Local Convergence of Newton’s Method Under a Weak Gamma Condition
We provide a local convergence analysis of Newton’s method under a weak gamma condition on a Banach space setting. It turns out that under the same computational cost and weaker hypotheses than in [4], [5], [7], we can obtain a larger radius of convergence and finer estimates on the distances involved. AMS (MOS) Subject Classification Codes: 65G99, 65B05, 47H17, 49M15.
متن کاملWeak Convergence of Mann Iterative Algorithm for two Nonexpansive mappings
The mann fixed point algorithm play an importmant role in the approximation of fixed points of nonexpansive operators. In this paper, by considering new conditions, we prove the weak convergence of mann fixed point algorithm, for finding a common fixed point of two nonexpansive mappings in real Hilbert spaces. This results extend the privious results given by Kanzow and Shehu. Finally, we give ...
متن کاملWeak and strong convergence theorems for a finite family of generalized asymptotically quasinonexpansive nonself-mappings
In this paper, we introduce and study a new iterative scheme toapproximate a common xed point for a nite family of generalized asymptoticallyquasi-nonexpansive nonself-mappings in Banach spaces. Several strong and weakconvergence theorems of the proposed iteration are established. The main resultsobtained in this paper generalize and rene some known results in the currentliterature.
متن کاملAn elementary proof of the weak convergence of empirical processes
This paper develops a simple technique for proving the weak convergence of a stochastic process Z̄n(g) := ∫ g dZn, indexed by functions g in some class G. The main novelty is a decoupling argument that allows to derive asymptotic equicontinuity of the process {Z̄n(g), g ∈ G} from that of the basic process {Zn(t), t ∈ R}, with Zn(t) = Z̄n(ft) and ft(x) = 1(−∞,t](x). The method leads to novel result...
متن کاملA proof of convergence for Ant algorithms
A proof of convergence for Ant algorithms is developed. Ant algorithms were modeled as branching random processes: the branching random walk and branching Wiener process to derive rates of birth and death of ant paths. Substitution is then carried out in birth-death processes, which proves that a stable distribution is surely reached. This indicates that Ant algorithms converge with probability...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1966
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1966-0206687-0